Algorithmic information theory

Results: 107



#Item
21Multi-GPU Computing for Achieving Speedup in Real-time Aggregate Risk Analysis A. K. Bahl Center for Security, Theory and Algorithmic Research International Institute of Information Technology Hyderabad, India aman.kumar

Multi-GPU Computing for Achieving Speedup in Real-time Aggregate Risk Analysis A. K. Bahl Center for Security, Theory and Algorithmic Research International Institute of Information Technology Hyderabad, India aman.kumar

Add to Reading List

Source URL: web.cs.dal.ca

Language: English - Date: 2013-11-04 16:38:20
    22QUANTUM ALGORITHMIC ENTROPY ´ PETER GACS A BSTRACT. We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (“universal probability”) as a starting point, and

    QUANTUM ALGORITHMIC ENTROPY ´ PETER GACS A BSTRACT. We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (“universal probability”) as a starting point, and

    Add to Reading List

    Source URL: www.cs.bu.edu

    Language: English - Date: 2005-03-01 13:02:46
      23INSTITUTE OF PHYSICS PUBLISHING Eur. J. PhysS69–S77 EUROPEAN JOURNAL OF PHYSICS doi:/26/5/S08

      INSTITUTE OF PHYSICS PUBLISHING Eur. J. PhysS69–S77 EUROPEAN JOURNAL OF PHYSICS doi:/26/5/S08

      Add to Reading List

      Source URL: samarcanda.phys.uniroma1.it

      Language: English - Date: 2007-11-30 04:52:45
      24Microsoft PowerPointRichard Karp.ppt

      Microsoft PowerPointRichard Karp.ppt

      Add to Reading List

      Source URL: www.wi-consortium.org

      Language: English - Date: 2007-11-22 04:26:14
      251 Learning, Regularity, and Compression Overview The task of inductive inference is to find laws or regularities underlying some given set of data. These laws are then used to gain insight

      1 Learning, Regularity, and Compression Overview The task of inductive inference is to find laws or regularities underlying some given set of data. These laws are then used to gain insight

      Add to Reading List

      Source URL: homepages.cwi.nl

      Language: English - Date: 2007-08-21 10:18:33
      26GREGORY CHAITIN1 CONCEPTUAL COMPLEXITY AND ALGORITHMIC INFORMATION2 1. Introduction

      GREGORY CHAITIN1 CONCEPTUAL COMPLEXITY AND ALGORITHMIC INFORMATION2 1. Introduction

      Add to Reading List

      Source URL: www.cs.umaine.edu

      Language: English - Date: 2015-05-21 14:47:00
      27MIT-CTP #3309 Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗

      MIT-CTP #3309 Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗

      Add to Reading List

      Source URL: arxiv.org

      Language: English - Date: 2008-02-01 00:39:23
      28On the Correlation Intractability of Obfuscated Pseudorandom Functions Ran Canetti∗ Yilei Chen†

      On the Correlation Intractability of Obfuscated Pseudorandom Functions Ran Canetti∗ Yilei Chen†

      Add to Reading List

      Source URL: eprint.iacr.org

      Language: English - Date: 2015-04-22 00:12:34
      29´ ´ Publications of Peter Gacs [1]

      ´ ´ Publications of Peter Gacs [1]

      Add to Reading List

      Source URL: www.cs.bu.edu

      Language: English - Date: 2013-09-03 15:59:52
      30Lecture Notes in Computer Science: Copyright Form 1 Fourth International Conference on Intelligent Data Engineering and

      Lecture Notes in Computer Science: Copyright Form 1 Fourth International Conference on Intelligent Data Engineering and

      Add to Reading List

      Source URL: www.comp.hkbu.edu.hk

      Language: English - Date: 2003-02-24 03:29:07